On Monotone Data Mining Languages
نویسندگان
چکیده
We present a simple Data Mining Logic (DML) that can express common data mining tasks, like “Find Boolean association rules” or “Find inclusion dependencies.” At the center of the paper is the problem of characterizing DML queries that are amenable to the levelwise search strategy used in the a-priori algorithm. We relate the problem to that of characterizing monotone first-order properties for finite models.
منابع مشابه
Using Constraints During Set Mining: Should We Prune or not?
Knowledge discovery in databases (KDD) is an interactive process that can be considered from a querying perspective. Within the inductive database framework, an inductive query on a database is a query that might return generalizations about the data e.g., frequent itemsets, association rules, data dependencies. To study evaluation schemes of such queries, we focus on the simple case of (freque...
متن کاملGenerator of Hypotheses – an Approach of Data Mining Based on Monotone Systems Theory
Generator of hypotheses is a new method for data mining. It makes possible to classify the source data automatically and produces a particular enumeration of patterns. Pattern is an expression (in a certain language) describing facts in a subset of facts. The goal is to describe the source data via patterns and/or IF...THEN rules. Used evaluation criteria are deterministic (not probabilistic). ...
متن کاملA fuzzy based scheme for sanitizing sensitive sequential patterns
The rapid advances in technology have led to generating and analyzing huge amounts of data in databases. The examples of such kind of data are bank records, web logs, cell phone records and network traffic records. This has raised a new challenge for people i.e., to transform this data into useful information. To achieve this task successfully, data mining is a vital technique. The aim of data ...
متن کاملTreillis Relationnel : Une Structure Algébrique pour le Data Mining Multi-Dimensionnel
Constrained multidimensional patterns differ from the well known frequent patterns from a conceptual and logical points of view because they are structured and support various types of constraints. Classical data mining techniques are based on the power set lattice and, even extended, are not suitable when addressing the discovery of multidimensional patterns. In this paper we propose a foundat...
متن کاملConstrained Cube Lattices for Multidimensional Database Mining
In multidimensional database mining, constrained multidimensional patterns differ from the well-known frequent patterns from both conceptual and log ical points of view because of a common structure and the ability to support various types of constraints. Classical data mining techniques are based on the power set lattice of binary attribute values and, even adapted, are not suitable when addre...
متن کامل